Automata represented by products of soliton automata
نویسندگان
چکیده
منابع مشابه
Quantization of Soliton Cellular Automata
A method of quantization of classical soliton cellular automata (QSCA) is put forward that provides a description of their time evolution operator by means of quantum circuits that involve quantum gates from which the associated Hamiltonian describing a quantum chain model is constructed. The intrinsic parallelism of QSCA, a phenomenon first known from quantum computers, is also emphasized.
متن کاملParticles in Soliton Cellular Automata
An initial configurat ion of the filter cellular automaton introduced by Park, Steiglitz, and Thurston can be thought of as consisting of a number of particles. Here we present a complet e analysis of the evolution of single particles. In particular, conditions are given for th e existence of periodic particles, and the period is computed in terms of the initial data.
متن کاملFrom LTL to Symbolically Represented Deterministic Automata
Temporal logics like LTL are frequently used for the specification and verification of reactive systems. For verification, LTL formulas are typically translated to generalized nondeterministic Büchi automata so that the verification problem is reduced to checking the emptiness of automata. While this can be done symbolically for nondeterministic automata, other applications require deterministi...
متن کاملSoliton automata with constant external edges
Soliton automata are the mathematical models of certain possible molecular switching devices. Both from theoretical and practical point of view, it is a central question to describe soliton automata with constant external edges. Extending a result of Dassow and Jürgensen, we characterize soliton automata in this special case.
متن کاملRelationship between Alternating omega-Automata and Symbolically Represented Nondeterministic omega-Automata
There is a well known relationship between alternating automata on finite words and symbolically represented nondeterministic automata on finite words. This relationship is of practical relevance because it allows to combine the advantages of alternating and symbolically represented nondeterministic automata on finite words. However, for infinite words the situation is unclear. Therefore, this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90135-5